Odd Graceful Labeling of Cycle with Parallel Pk Chords

نویسندگان

  • R. Govindarajan
  • V. Srividya
چکیده

A graph labeling is an assignment of integers to the vertices (or) edges or both subject to certain conditions. Graceful labeling was introduced by Rosa [6] while the concept of odd graceful labeling was introduced by Gnanajothi [2]. A Graph G (V, E), |V(G)| = p, |E(G)| = q is said to be odd graceful if there is an injection from V(G) to {0, 1, 2, .... 2q-1} such that when each edge xy is assigned the label |f(x) f(y)| the resulting edge labels are distinct and are in the set {1, 3, 5, ... 2q-1}. In this paper we prove theodd gracefulness of every even cycle Cn, n ≥ 6 with parallel Pk chords for k = 3, 5 and also prove the odd gracefulness of every odd cycle Cnn≥ 7 with parallel Pkchords for k = 2,4 after the removal of 2 edges from the cycle Cn.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles

In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and 1 n − edge is odd graceful, and the cycle graph m C with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph m n C P ∪ when 4, 6,8,10 m = and then we proved that the graph m n C P ∪ is odd graceful if m is even. Finall...

متن کامل

Odd Graceful Labeling of Some New Type of Graphs

In this paper some new type of odd graceful graphs are investigated. We prove that the graph obtained by joining a cycle C8 with some star graphs S1,r keeping one vertex and three vertices gap between pair of vertices of the cycle admits odd graceful labelling. We also prove that the graph obtained by joining a cycle C12 with some star graphs S1,r keeping two, three and five vertices gap betwee...

متن کامل

Improper Graceful and Odd-graceful Labellings of Graph Theory

Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.

متن کامل

Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edge-odd graceful graph. In this paper, the edge odd gracefulness of paths p1, p2, p3,..., ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014